A LINK BETWEEN ORDERED TREES AND GREEN-RED TREES
نویسندگان
چکیده
منابع مشابه
Lattice-based Similarity Measures between Ordered Trees
A clustering algorithm has recently been developed by Reitman and Rueter to express both the structure of chunking in multi-trial free recall and the order of chunk production. The resulting ordered trees differ from ordinary rooted trees in that the elements of a chunk, at any level, may be restricted to a specific ordering. In order to make comparisons of long-term memory structures between s...
متن کاملEdit distance between unlabeled ordered trees
There exists a bijection between one stack sortable permutations –permutations which avoid the pattern 231– and planar trees. We define an edit distance between permutations which is coherent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for (231) avoiding permutations. Moreover, we obtain the generatin...
متن کاملLocal similarity between quotiented ordered trees
In this paper we propose a dynamic programming algorithm to evaluate local similarity between ordered quotiented trees using a constrained edit scoring scheme. A quotiented tree is a tree defined with an additional equivalent relation on vertices and such that the quotient graph is also a tree. The core of the method relies on two adaptations of an algorithm proposed by Zhang et al. [1] for com...
متن کاملA correspondence between ordered trees and noncrossing partitions
The Narayana numbers n appear twice in Volume 31 of Discrete Mathematics: They count the ordere0 trees with n edges (i.e. n+l nodes) and k leaves [1] and the noncrossing partitions of {1 ..... n} into k blocks [2]. (In such a partition the existence of four numbers a<b<c<d such that a and c are in one block and b and d are in another block is forbidden.) The aim of this note is to exhibit a bij...
متن کاملPDL for Ordered Trees
This paper is about a special version of PDL, designed by Marcus Kracht for reasoning about sibling ordered trees. It has four basic programs corresponding to the child, parent, leftand right-sibling relations in such trees. The original motivation for this language is rooted in the field of model-theoretic syntax. Motivated by recent developments in the area of semistructured data, and, especi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Mathematical Society
سال: 2016
ISSN: 0304-9914
DOI: 10.4134/jkms.2016.53.1.187